Bipartite Permutation Graphs with Application to the Minimum Buffer Size Problem
نویسندگان
چکیده
This paper presents a new characterizations of bipartite permutation graphs and a structure theorem for (0,1)-matrices with a special consecutive 1's property. These results lead to a linear time algorithm for the minimum buuer size problem when restricted to bipartite permutation graphs; this problem arises in relational database systems and is NP-hard for a general graph.
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملBipartite permutation graphs
Bipartite graphs and permutation graphs are two well known subfamilies of the perfect graphs. Neither of these families is contained in the other, and their intersection is nonempty. This paper shows that graphs which are both bipartite and permutation graphs have good algorithmic properties. These graphs can be recognized in linear time, and several problems which are NP-complete or of unknown...
متن کاملOn Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs
We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained graphs. We show that the problem is linear time solvable for bipartite permutation graphs and NP-hard for grid intersection graphs. We also show that the problem is solvable in O(n2 log6 n) time for n-vertex graphs with maximum degree at most three. key words: 3-regular graph, bipartite permutat...
متن کاملLinear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bipartite permutation graph is proposed in this note. The decomposition gives a linear structure of bipartite permutation graphs, and it can be obtained in O(n) time, where n is the number of vertices. As an application o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 74 شماره
صفحات -
تاریخ انتشار 1997